Constructing Stable Clustering Structure for Uncertain Data Set
نویسندگان
چکیده
منابع مشابه
Subspace Clustering for Uncertain Data
Analyzing uncertain databases is a challenge in data mining research. Usually, data mining methods rely on precise values. In scenarios where uncertain values occur, e.g. due to noisy sensor readings, these algorithms cannot deliver highquality patterns. Beside uncertainty, data mining methods face another problem: high dimensional data. For finding object groupings with locally relevant dimens...
متن کاملA Framework for Clustering Uncertain Data
The challenges associated with handling uncertain data, in particular with querying and mining, are finding increasing attention in the research community. Here we focus on clustering uncertain data and describe a general framework for this purpose that also allows to visualize and understand the impact of uncertainty—using different uncertainty models—on the data mining results. Our framework ...
متن کاملOn Clustering Algorithms for Uncertain Data
In this chapter, we will study the clustering problem for uncertain data. When information about the data uncertainty is available, it can be leveraged in order to improve the quality of the underlying results. We will provide a survey of the different algorithms for clustering uncertain data. This includes recent algorithms for clustering static data sets, as well as the algorithms for cluster...
متن کاملDAGger: Clustering Correlated Uncertain Data
◮ It can compute exact and approximate probabilities with error guarantees for the clustering output. State-of-the-art techniques (e.g. UK-means, UKmedoids, MMVar): ◮ do not support the possible worlds semantics, ◮ lack support for correlations and assume probabilistic independence, ◮ use deterministic cluster medoids or expected means, and ◮ can only compute clustering based on expected distan...
متن کاملA Review of Clustering Algorithms for Clustering Uncertain Data
Clustering is an important task in the Data Mining. Clustering on uncertain data is a challenging in both modeling similarity between objects of uncertain data and developing efficient computational method. The most of the previous method extends partitioning clustering methods and Density based clustering methods, which are based on geometrical distance between two objects. Such method cannot ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Electrotechnica et Informatica
سال: 2011
ISSN: 1338-3957,1335-8243
DOI: 10.2478/v10198-011-0028-5